Decomposing a Chunk into Its Elements and Reorganizing Them As a New Chunk: The Two Different Sub-processes Underlying Insightful Chunk Decomposition

Decomposing a Chunk into Its Elements and Reorganizing Them As a New Chunk: The Two Different Sub-processes Underlying Insightful Chunk Decomposition

Familiar chunks can be processed highly efficiently, and this automatic process can prohibit the problem solver from developing novel and original ways to creatively solve difficult problems. For this reason, the role of the reverse process, chunk decomposition (CD), the process by which familiar patterns are broken down into their component elements in order to be regrouped in another meaningf...

Chunk Parsing

1.1 Motivation There are two chief motivations for chunking: to locate information, or to ignore information. In the former case, we may want to extract all noun phrases so that they can be indexed. A text retrieval system could the use the index to support e cient retrieval for queries involving terminological expressions. A message understanding system will extract salient chunks of text from...

How Big Is a Chunk?

Intra-Chunk Dependency Annotation : Expanding Hindi Inter-Chunk Annotated Treebank

We present two approaches (rule-based and statistical) for automatically annotating intra-chunk dependencies in Hindi. The intra-chunk dependencies are added to the dependency trees for Hindi which are already annotated with inter-chunk dependencies. Thus, the intra-chunk annotator finally provides a fully parsed dependency tree for a Hindi sentence. In this paper, we first describe the guideli...

Chunk-Based EBMT

Corpus driven machine translation approaches such as Phrase-Based Statistical Machine Translation and Example-Based Machine Translation have been successful by using word alignment to find translation fragments for matched source parts in a bilingual training corpus. However, they still cannot properly deal with systematic translation for insertion or deletion words between two distant language...